k-Lehmer three mean labeling of some graphs

Further results on odd mean labeling of some subdivision graphs

Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...

k-equitable mean labeling

One Modulo Three Mean Labeling of Graphs

In this paper, we introduce a new labeling called one modulo three mean labeling. A graph G is said to be one modulo three mean graph if there is an injective function φ from the vertex set of G to the set {a | 0 ≤ a ≤ 3q2 and either a≡0(mod 3) or a≡1(mod 3) } where q is the number of edges of G and φ induces a bijection φ * from the edge set of G to { } |1 3 2 and ( 3) a a q a 1 mod ≤ ≤ − ≡ gi...

further results on odd mean labeling of some subdivision graphs

let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...

Further results on total mean cordial labeling of graphs

A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...